#include <bits/stdc++.h>

#define in read()
#define fi first
#define se second
#define pb push_back

using namespace std;

using pii = pair < int , int >;
using vec = vector < int >;
using veg = vector < pii >;
using ll = long long;
using db = double;

int read() {
    int x = 0; bool f = 0; char ch = getchar(); while(!isdigit(ch)) f |= ch == '-',ch = getchar();
    while(isdigit(ch)) x = x * 10 + (ch ^ 48),ch = getchar(); return f ? -x : x;
}

const int N = 5e5 + 10;

int a[N],n;
map < int , int > cnt;

void solve() {
	n = in; int mx = 0; for(int i = 1;i <= n;i++) a[i] = in,cnt[a[i]]++;
	for(auto d : cnt) mx = max(mx,d.se);
	mx = max(mx,min(n,2));
	printf("%d\n",n - mx);
	cnt.clear();
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
#endif
    for(int T = in;T;T--) solve(); return 0;
}
